Parallel Virtual Memory for Time Shared Environments

This paper analyses the issues involved in providing virtual distributed shared memory for time-shared parallel machines. We study the performance of two di erent page management policies, namely, static and dynamic page allocation under two widely accepted scheduling policies: Gang scheduling and independent processor scheduling. The performance of each page management policy is studied under di erent replacement scopes (local versus global replacement). Results obtained after extensive simulations show that dynamic page allocation performs better throughout all the environments simulated. We also observe a better performance of independent processor over gang scheduling as well as a similar performance between local and global replacement scope.